Scheduling Policies for Processor Coallocation in Multicluster Systems
نویسندگان
چکیده
منابع مشابه
Processor Saving Scheduling Policies for Multiprocessor Systems
In this paper, processor scheduling policies that “save” processors are introduced and studied. In a multiprogrammed parallel system, a “processor saving” scheduling policy purposefully keeps some of the available processors idle in the presence of work to be done. The conditions under which processor saving policies can be more effective than their greedy counterparts, i.e., policies that neve...
متن کاملThe Performance of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which are interconnected by relatively slow communication links and which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the simultaneous allocation of processors to single jobs in different clusters, may be required. We study the performance of co-allocation by means of si...
متن کاملThe Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the simultaneous allocation of processors to single jobs in multiple clusters, may be required. In studies of scheduling in single clusters it has been shown that the achievable (maximal) utilization may be much less than...
متن کاملPriorities among Multiple Queues for Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the simultaneous allocation of processors to single jobs in multiple clusters, may be required. In order to handle both single-cluster (local) jobs and multi-cluster (global) jobs, such systems may have only local schedul...
متن کاملResource CoAllocation for Scheduling Tasks with Dependencies, in Grid
Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamentally important in order to achieve optimized resources utilization. The existing and potential applications include many fields of activity like satellite image processing and medicine. The paper proposes a scheduling al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2007
ISSN: 1045-9219
DOI: 10.1109/tpds.2007.1036